Cache-Aided Content Delivery Over Erasure Broadcast Channels
نویسندگان
چکیده
منابع مشابه
Joint Cache-Channel Coding over Erasure Broadcast Channels
We consider a cache-aided communications system in which a transmitter communicates with many receivers over an erasure broadcast channel. The system serves as a basic model for communicating on-demand content during periods of high network congestion, where some content can be preplaced in local caches near the receivers. We formulate the cacheaided communications problem as a joint cache-chan...
متن کاملOn Coding for Cache-Aided Delivery of Dynamic Correlated Content
Cache-aided coded multicast leverages side information at wireless edge caches to efficiently serve multiple unicast demands via common multicast transmissions, leading to load reductions that are proportional to the aggregate cache size. However, the increasingly dynamic, unpredictable, and personalized nature of the content that users consume challenges the efficiency of existing caching-base...
متن کاملOptimal Linear Network Coding When 3 Nodes Communicate Over Broadcast Erasure Channels with ACK
This work considers the following scenario: Three nodes {1, 2, 3} would like to communicate with each other by sending packets through unreliable wireless medium. We consider the most general unicast traffic demands. Namely, there are six co-existing unicast flows with rates (R1→2, R1→3, R2→1, R2→3, R3→1, R3→2). When a node broadcasts a packet, a random subset of the other two nodes will receiv...
متن کاملSecure Capacity Region for Erasure Broadcast Channels with Feedback
We formulate and study a cryptographic problem relevant to wireless: a sender, Alice, wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. We ask, at what rates can we broadcast the private messages if we also provide (information-theoretic) unconditional security guarantees that Bob...
متن کاملSecrecy Capacity-Memory Tradeoff of Erasure Broadcast Channels
This paper derives upper and lower bounds on the secrecy capacity-memory tradeoff of a wiretap erasure broadcast channel (BC) with Kw weak receivers and Ks strong receivers, where weak receivers, respectively strong receivers, have same erasure probabilities and cache sizes. The lower bounds are achieved by schemes that meticulously combine joint cache-channel coding with wiretap coding and key...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2018
ISSN: 0090-6778
DOI: 10.1109/tcomm.2017.2751608